Resource allocation flowshop scheduling with learning effect and slack due window assignment

We study flowshop scheduling problems with respect to slack due window assignments, which are operations in jobs assigned an individual window. We combine learning effect and controllable processing times, the has a two-machine no-wait setup. The goal is determine job sequence, based on common flow allowance, size, resource allocation. provide bicriteria analysis for consumption costs. show that two costs can be solved polynomial time utilizing three different combinations.